The Tractability Frontier of Graph-Like First-Order Query Sets
نویسندگان
چکیده
منابع مشابه
The Tractability Frontier for NFA Minimization
We prove that minimizing finite automata is NP-hard for almost all classes of automata that extend the class of deterministic finite automata. More specifically, we show that minimization is NP-hard for all finite automata classes that subsume the class of δNFAs which accept strings of length at most three. Here, δNFAs are the finite automata that are unambiguous, allow at most one state q with...
متن کاملThe tractability frontier of well-designed SPARQL queries
We study the complexity of query evaluation of SPARQL queries. We focus on the fundamental fragment of welldesigned SPARQL restricted to the AND, OPTIONAL and UNION operators. Our main result is a structural characterisation of the classes of well-designed queries that can be evaluated in polynomial time. In particular, we introduce a new notion of width called domination width, which relies on...
متن کاملCharting the Tractability Frontier of Mixed Multi-Unit Combinatorial Auctions
Mixed multi-unit combinatorial auctions (MMUCAs) are extensions of classical combinatorial auctions (CAs) where bidders trade transformations of goods rather than just sets of goods. Solving MMUCAs, i.e., determining the sequences of bids to be accepted by the auctioneer, is computationally intractable in general. However, differently from CAs, little was known about whether polynomialtime solv...
متن کاملAlgebraic Geometry Over Four Rings and the Frontier to Tractability
We present some new and recent algorithmic results concerning polynomial system solving over various rings. In particular, we present some of the best recent bounds on: (a) the complexity of calculating the complex dimension of an algebraic set (b) the height of the zero-dimensional part of an algebraic set over C (c) the number of connected components of a semi-algebraic set We also present so...
متن کاملOverlapping coalition formation games: charting the tractability frontier
Cooperative games with overlapping coalitions (OCF games) [3, 23] model scenarios where agents can distribute their resources among several tasks; each task generates a profit which may be freely divided among the agents participating in the task. The goal of this work is to initiate a systematic investigation of algorithmic aspects of OCF games. We propose a discretized model of overlapping co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2017
ISSN: 0004-5411,1557-735X
DOI: 10.1145/3073409